The multi-depot periodic vehicle routing problemMINGOZZI, Aristide.Lecture notes in computer science. 2005, pp 347-350, issn 0302-9743, isbn 3-540-27872-9, 4 p.Conference Paper

Minimal load constrained vehicle routing problemsKARA, Imdat; BEKTAS, Tolga.Lecture notes in computer science. 2005, pp 188-195, issn 0302-9743, isbn 3-540-26032-3, 3Vol, 8 p.Conference Paper

Problèmes de tournées avec gains : étude et application au transport inter-usines = Routing problems with profits : Study and application to a freight transportation problemFeillet, Dominique; Dejax, Pierre.2001, 212 p.Thesis

On the reformulation of vehicle routing problems and scheduling problemsBECK, J. Christopher; PROSSER, Patrick; SELENSKY, Evgeny et al.Lecture notes in computer science. 2002, pp 282-289, issn 0302-9743, isbn 3-540-43941-2, 8 p.Conference Paper

The efficacy of exclusive territory assignments to delivery vehicle driversHAUGHTON, Michael A.European journal of operational research. 2007, Vol 184, Num 1, pp 24-38, issn 0377-2217, 15 p.Article

A unified-metaheuristic frameworkOSMAN, I. H.Lecture notes in computer science. 1999, pp 11-12, issn 0302-9743, isbn 3-540-66076-3Conference Paper

Approche polyédrale du problème de tournées de véhicules = Polyhedral approach of the vehicle routing problemAugerat, Philippe; Naddef, D.1995, 139 p.Thesis

A new enhancement of the Clarke and wright savings heuristic for the capacitated vehicle routing problemALTINEL, I. K; ÖNCAN, T.The Journal of the Operational Research Society. 2005, Vol 56, Num 8, pp 954-961, issn 0160-5682, 8 p.Article

Competitive analysis of a dispatch policy for a dynamic multi-period routing problemANGELELLI, Enrico; SAVELSBERGH, Martin W. P; GRAZIA SPERANZA, M et al.Operations research letters. 2007, Vol 35, Num 6, pp 713-721, issn 0167-6377, 9 p.Article

Tabu search variants for the mix fleet vehicle routing problemWASSAN, N. A; OSMAN, I. H.The Journal of the Operational Research Society. 2002, Vol 53, Num 7, pp 768-782, issn 0160-5682Article

Forty Years of Periodic Vehicle RoutingCAMPBELL, Ann Melissa; WILSON, Jill Hardin.Networks (New York, NY). 2014, Vol 63, Num 1, pp 2-15, issn 0028-3045, 14 p.Conference Paper

Pickup and delivery for moving objects on broken linesASAHIRO, Yuichi; MIYANO, Eiji; SHIMOIRISA, Shinichi et al.Lecture notes in computer science. 2005, pp 36-50, issn 0302-9743, isbn 3-540-29106-7, 1Vol, 15 p.Conference Paper

A 2-approximation algorithm for the multi-vehicle scheduling problem on a path with release and handling timesKARUNO, Yoshiyuki; NAGAMOCHI, Hiroshi.Lecture notes in computer science. 2001, pp 218-229, issn 0302-9743, isbn 3-540-42493-8Conference Paper

Special issue on industrial constraint-directed schedulingBECK, J. Christopher; DAVENPORT, A. J; LE PAPE, Claude et al.Constraints (Dordrecht). 2000, Vol 5, Num 4, issn 1383-7133, 97 p.Serial Issue

A continuous approximation model for the fleet composition problemJABALI, Ola; GENDREAU, Michel; LAPORTE, Gilbert et al.Transportation research. Part B : methodological. 2012, Vol 46, Num 10, pp 1591-1606, issn 0191-2615, 16 p.Article

A simple and efficient tabu search heuristic for solving the open vehicle routing problemDERIGS, U; REUTER, K.The Journal of the Operational Research Society. 2009, Vol 60, Num 12, pp 1658-1669, issn 0160-5682, 12 p.Article

Adaptive memory programming for the vehicle routing problem with multiple tripsOLIVERA, Alfredo; VIERA, Omar.Computers & operations research. 2007, Vol 34, Num 1, pp 28-47, issn 0305-0548, 20 p.Article

On dynamic pickup and delivery vehicle routing with several time windows and waiting timesFABRI, A; RECHT, P.Transportation research. Part B : methodological. 2006, Vol 40, Num 4, pp 335-350, issn 0191-2615, 16 p.Article

A new tabu search heuristic for the open vehicle routing problemFU, Z; EGLESE, R; LYO, Li et al.The Journal of the Operational Research Society. 2005, Vol 56, Num 3, pp 267-274, issn 0160-5682, 8 p.Article

Parallel simulated annealing for bicriterion optimization problemsCZARNAS, Piotr; CZECH, Zbigniew J; GOCYŁA, Przemyslaw et al.Lecture notes in computer science. 2004, pp 233-240, issn 0302-9743, isbn 3-540-21946-3, 8 p.Conference Paper

New heuristics for the Fleet Size and Mix Vehicle Routing Problem with Time WindowsDULLAERT, W; JANSSENS, G. K; SÖRENSEN, K et al.The Journal of the Operational Research Society. 2002, Vol 53, Num 11, pp 1232-1238, issn 0160-5682, 7 p.Article

An experimental study of a simple Ant Colony System for the Vehicle Routing Problem with Time WindowsELLABIB, Ismail; BASIR, Otman A; CALAMAI, Paul et al.Lecture notes in computer science. 2002, pp 53-64, issn 0302-9743, isbn 3-540-44146-8, 12 p.Conference Paper

Planification tactique de transport de marchandises interusine : Application au secteur automobile = tactical planning for freight transportation within a network of industrial sitesFEILLET, Dominique; DEJAX, Pierre; GENDREAU, Michel et al.Journal européen des systèmes automatisés. 2002, Vol 36, Num 1, pp 149-168, issn 1269-6935Conference Paper

A new approximation algorithm for the capacitated vehicle routing problem on a treeASANO, Tetsuo; KATOH, Naoki; KAWASHIMA, Kazuhiro et al.Journal of combinatorial optimization. 2001, Vol 5, Num 2, pp 213-231, issn 1382-6905Article

Quantifying the benefits of route reoptimisation under stochastic customer demandsHAUGHTON, M. A.The Journal of the Operational Research Society. 2000, Vol 51, Num 3, pp 320-332, issn 0160-5682Article